Locally identifying coloring in bounded expansion classes of graphs
نویسندگان
چکیده
منابع مشابه
Locally identifying coloring in bounded expansion classes of graphs
A proper vertex coloring of a graph is said to be locally identifying if the sets of colors in the closed neighborhood of any two adjacent non-twin vertices are distinct. The lid-chromatic number of a graph is the minimum number of colors used by a locally identifying vertex-coloring. In this paper, we prove that for any graph class of bounded expansion, the lid-chromatic number is bounded. Cla...
متن کاملLocally Identifying Coloring of Graphs
We introduce the notion of locally identifying coloring of a graph. A proper vertex-coloring c of a graph G is said to be locally identifying, if for any adjacent vertices u and v with distinct closed neighborhood, the sets of colors that appear in the closed neighborhood of u and v are distinct. Let χlid(G) be the minimum number of colors used in a locally identifying vertex-coloring of G. In ...
متن کاملHomomorphism bounded classes of graphs
A class C of graphs is said to be H-bounded if each graph in the class C admits a homomorphism to H. We give a general necessary and sufficient condition for the existence of bounds with special local properties. This gives a new proof of Häggkvist-Hell theorem [5] and implies several cases of the existence of triangle free bounds for planar graphs.
متن کاملBounded expansion in web graphs
In this paper we study various models for web graphs with respect to bounded expansion. All the deterministic models even have constant expansion, whereas the copying model has unbounded expansion. The most interesting case turns out to be the preferential attachment model — which we conjecture to have unbounded expansion, too.
متن کاملStar Coloring and Acyclic Coloring of Locally Planar Graphs
It is proved that every graph embedded in a fixed surface with sufficiently large edge-width is acyclically 7-colorable and that its star chromatic number is at most 2s * 0 + 3, where s * 0 ≤ 20 is the maximum star chromatic number for the class of all planar graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.07.003